Initial Population Construction for Convergence Improvement of MOEAs
نویسندگان
چکیده
Nearly all Multi-Objective Evolutionary Algorithms (MOEA) rely on random generation of initial population. In large and complex search spaces, this random method often leads to an initial population composed of infeasible solutions only. Hence, the task of a MOEA is not only to converge towards the Pareto-optimal front but also to guide the search towards the feasible region. This paper proposes the incorporation of a novel method for constructing initial populations into existing MOEAs based on so-called Pareto-Front-Arithmetics (PFA). We will provide experimental results from the field of embedded system synthesis that show the effectiveness of our proposed methodology.
منابع مشابه
Assessing solution quality of biobjective 0-1 knapsack problem using evolutionary and heuristic algorithms
Multiobjective 0-1 knapsack problem involving multiple knapsacks is a widely studied problem. In this paper, we consider a formulation of the biobjective 0-1 knapsack problem which involves a single knapsack; this formulation ismore realistic and hasmany industrial applications. Though it is formulated using simple linear functions, it is an NP-hard problem. We consider three different types of...
متن کاملA mullti- or many- objective evolutionary algorithm with global loop update
Multior many-objective evolutionary algorithms(MOEAs), especially the decomposition-based MOEAs have been widely concerned in recent years. The decomposition-based MOEAs emphasize convergence and diversity in a simple model and have made a great success in dealing with theoretical and practical multior many-objective optimization problems. In this paper, we focus on update strategies of the dec...
متن کاملThe new implicit finite difference scheme for two-sided space-time fractional partial differential equation
Fractional order partial differential equations are generalizations of classical partial differential equations. Increasingly, these models are used in applications such as fluid flow, finance and others. In this paper we examine some practical numerical methods to solve a class of initial- boundary value fractional partial differential equations with variable coefficients on a finite domain. S...
متن کاملParallelization of Multi-objective Evolutionary Algorithms Using Clustering Algorithms
While Single-Objective Evolutionary Algorithms (EAs) parallelization schemes are both well established and easy to implement, this is not the case for Multi-Objective Evolutionary Algorithms (MOEAs). Nevertheless, the need for parallelizing MOEAs arises in many real-world applications, where fitness evaluations and the optimization process can be very time consuming. In this paper, we test the ...
متن کاملMulti-Objective Genetic Programming with Redundancy-Regulations for Automatic Construction of Image Feature Extractors
We propose a new multi-objective genetic programming (MOGP) for automatic construction of image feature extraction programs (FEPs). The proposed method was originated from a well known multiobjective evolutionary algorithm (MOEA), i.e., NSGA-II. The key differences are that redundancy-regulation mechanisms are applied in three main processes of the MOGP, i.e., population truncation, sampling, a...
متن کامل